Bipartite Digraphs Debates
نویسنده
چکیده
A novel graph-based model for aggregating dichotomous preferences is introduced. The output opinion is viewed as a consensual situation, paving the way of using graph operations to describe properties of the aggregators. The outputs are also dichotomous preferences which could be useful in some applications. New axiomatic characterizations of aggregators corresponding to usual majority or approval &disapproval rule are presented. Integrating and exploiting Dung’s Argumentation Frameworks and their semantics into our model is another contribution of the present paper.
منابع مشابه
Pushing vertices in digraphs without long induced cycles
Given a digraph D and a subset X of vertices of D, pushing X in D means reversing the orientation of all arcs with exactly one end in X. It is known that the problem of deciding whether a given digraph can be made acyclic using the push operation is NP-complete for general digraphs, and polynomial time solvable for multipartite tournaments. Here, we continue the study of deciding whether a digr...
متن کاملLarge Cayley digraphs of given degree and diameter from sharply t-transitive groups
We construct a family of Cayley digraphs of degree d, diameter k and order kbd/2ck for any d ≥ 4 and k ≥ 3. We also present a collection of bipartite Cayley digraphs of order at least (k − 1)bd/2ck−1 for any degree d ≥ 4 and diameter k ≥ 4. For sufficiently large d and k, our digraphs are the largest known Cayley digraphs of degree d and diameter k, where k 6= d − 1 or d, and our bipartite digr...
متن کاملLarge Cayley digraphs and bipartite Cayley digraphs of odd diameters
Let Cd,k be the largest number of vertices in a Cayley digraph of degree d and diameter k, and let BCd,k be the largest order of a bipartite Cayley digraph for given d and k. For every degree d ≥ 2 and for every odd k we construct Cayley digraphs of order 2k ( ⌊d2⌋ )k and diameter at most k, where k ≥ 3, and bipartite Cayley digraphs of order 2(k − 1) ( ⌊d2⌋ )k−1 and diameter at most k, where k...
متن کاملHighly arc-transitive digraphs - Structure and counterexamples
Two problems of Cameron, Praeger, and Wormald [Infinite highly arc transitive digraphs and universal covering digraphs, Combinatorica (1993)] are resolved. First, locally finite highly arc-transitive digraphs with universal reachability relation are presented. Second, constructions of two-ended highly arc-transitive digraphs are provided, where each ‘building block’ is a finite bipartite digrap...
متن کاملHighly arc-transitive digraphs – counterexamples and structure∗
We resolve two problems of [Cameron, Praeger, and Wormald – Infinite highly arc transitive digraphs and universal covering digraphs, Combinatorica 1993]. First, we construct a locally finite highly arc-transitive digraph with universal reachability relation. Second, we provide constructions of 2-ended highly arc transitive digraphs where each ‘building block’ is a finite bipartite graph that is...
متن کامل